ASSOCIATIVE SHORTEST AND LONGEST PATH PROBLEMS
نویسندگان
چکیده
منابع مشابه
Stochastic shortest path problems with associative accumulative criteria
We consider a stochastic shortest path problem with associative criteria in which for each node of a graph we choose a probability distribution over the set of successor nodes so as to reach a given target node optimally. We formulate such a problem as an associative Markov decision processes. We show that an optimal value function is a unique solution to an optimality equation and find an opti...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملRobust shortest path problems
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...
متن کاملShortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملRecoverable robust shortest path problems
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1999
ISSN: 0286-522X
DOI: 10.5109/13487